Recognizing simple-triangle graphs by restricted 2-chain subgraph cover
نویسندگان
چکیده
منابع مشابه
Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover
A simple-triangle graph (also known as a PI graph) is the intersection graph of a family of triangles defined by a point on a horizontal line and an interval on another horizontal line. The recognition problem for simple-triangle graphs was a longstanding open problem, and recently a polynomial-time algorithm has been given [G. B. Mertzios, The Recognition of Simple-Triangle Graphs and of Linea...
متن کاملGeneralized subgraph-restricted matchings in graphs
For a graph property P, we define a P-matching as a set M of disjoint edges such that the subgraph induced by the vertices incident to M has property P. Previous examples include strong/induced matchings and uniquely restricted matchings. We explore the general properties of P-matchings, but especially the cases where P is the property of being acyclic or the property of being disconnected. We ...
متن کاملTriangle Graphs and Simple Trapezoid Graphs
In the literature of graph recognition algorithms, two of the most extensively covered graphs are interval graphs and permutation graphs [6, 2]. One way of generalizing both interval graphs and permutation graphs is the intersection graph of a collection of trapezoids with corner points lying on two parallel lines. Such a graph is called the trapezoid graph [3, 4]; Ma and Spinrad [8] show that ...
متن کاملThe induced matching and chain subgraph cover problems for convex bipartite graphs
We present an O(n2)-time algorithm for computing a maximum cardinality induced matching and a minimum cardinality cover by chain subgraphs for convex bipartite graphs. This improves the previous time bound of O(m2). c © 2007 Elsevier B.V. All rights reserved.
متن کاملOn the Complexity of the k-Chain Subgraph Cover Problem
The k-chain subgraph cover problem asks if the edge set of a given bipartite graph G is the union of the edge sets of k chain graphs, where each chain graph is a subgraph of G. Although the X--chain subgraph cover problem is known to be NP-complete for the class of bipartite graphs, it is still unknown whether this problem is NP-complete or polynomial-time solvable for subclasses of bipartite g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2020
ISSN: 0166-218X
DOI: 10.1016/j.dam.2019.10.028